Solving Multicut Faster than 2
نویسندگان
چکیده
In the Multicut problem, we are given an undirected graph G = (V,E) and a family T = {(si, ti) | si, ti ∈ V } of pairs of requests and the objective is to find a minimum sized set S ⊆ V such that every connected component of G \ S contains at most one of si and ti for any pair (si, ti) ∈ T . In this paper we give the first non-trivial algorithm for Multicut running in time O(1.987).
منابع مشابه
Multi-person Tracking by Multicut and Deep Matching
In [1], we proposed a graph-based formulation that links and clusters person hypotheses over time by solving a minimum cost subgraph multicut problem. In this paper, we modify and extend [1] in three ways: 1) We introduce a novel local pairwise feature based on local appearance matching that is robust to partial occlusion and camera motion. 2) We perform extensive experiments to compare differe...
متن کاملParallel Multicut Segmentation via Dual Decomposition
We propose a new outer relaxation of the multicut polytope, along with a dual decomposition approach for correlation clustering and multicut segmentation, for general graphs. Each subproblem is a minimum st-cut problem and can thus be solved efficiently. An optimal reparameterization is found using subgradients and affords a new characterization of the trivial LP relaxation of the multicut prob...
متن کامل7.1 Multicut
P∈Pi P∋e fi,P ≤ ce ∀e fi,P ≥ 0 Dual 1 solves the max-sum multi-commodity flow problem: ce represents the capacity of an edge, and fi,P is the amount of flow directed from si to ti along the path P . The LP tries to maximize the total amount of commodity flow. Lemma 17.1.1 Multicut is always larger than the corresponding max-sum multi-commodity flow. Lemma 17.1.2 Multicut is at most O(logK) time...
متن کاملApproximating the k-multicut problem
We study the k-multicut problem: Given an edgeweighted undirected graph, a set of l pairs of vertices, and a target k ≤ l, find the minimum cost set of edges whose removal disconnects at least k pairs. This generalizes the well known multicut problem, where k = l. We show that the k-multicut problem on trees can be approximated within a factor of 83 + 2, for any fixed 2 > 0, and within O(log n ...
متن کاملDirected paths on a tree: coloring, multicut and kernel
In a paper published in Journal of Combinatorial Theory, Series B (1986), Monma and Wei propose an extensive study of the intersection graph of paths on a tree. They explore this notion by varying the notion of intersection: the paths are respectively considered to be the sets of their vertices and the sets of their edges, and the trees may or may not be directed. Their main results are a chara...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014